D-Node Retargeting in Bidirectional Heuristic Search
نویسندگان
چکیده
AIthough it is generally agreed that bidirectional heuristic search is potentially more efficient than unidirectional heuristic search, so far there have been no algorithms which realize this potential. The basic difficulty is that the two search trees (one rooted at the start, the other at the goal) do not meet in the middle. This results in essentiofly two unidirectional starches and poorer performance. In this paper we present an efficient olge rithm for bidirectional heuristic search which overcomes this difficulty. We also compare this algorithm with de Champeaux’s BHFFA (2331 on the basis of search efficiency, solution quality, and computational cost.
منابع مشابه
Bidirectional Heuristic Search Reconsidered
The assessment of bidirectional heuristic search has been incorrect since it was rst published more than a quarter of a century ago. For quite a long time, this search strategy did not achieve the expected results, and there was a major misunderstanding about the reasons behind it. Although there is still widespread belief that bidirectional heuristic search is aaicted by the problem of search ...
متن کاملSufficient Conditions for Node Expansion in Bidirectional Heuristic Search
In this paper we study bidirectional state space search with consistent heuristics, with a focus on obtaining sufficient conditions for node expansion, i.e., conditions characterizing nodes that must be expanded by any admissible bidirectional search algorithm. We provide such conditions for front-to-front and front-to-end bidirectional search. The sufficient conditions are used to prove that t...
متن کاملBidirectional Heuristic
The assessment of bidirectional heuristic search has been incorrect since it was rst published more than a quarter of a century ago. For quite a long time, this search strategy did not achieve the expected results, and there was a major misunderstanding about the reasons behind it. Although there is still wide-spread belief that bidirectional heuristic search is a icted by the problem of search...
متن کاملDivide-and-Conquer Bidirectional Search
We present a new algorithm to reduce the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain large numbers of cycles. For example, the problem of finding a lowest-cost corner-to-corner path in a D-dimensional grid has application to gene sequence alignment in computational biology. The main idea is to perform a bidi...
متن کاملA Divide and Conquer Bidirectional Search: First Results
We present a new algorithm to reduce the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially wi th problem size, but contain large numbers of short cycles. For example, the problem of finding a lowest-cost corner-to-corner path in a d-dimensional grid has application to gene sequence alignment in computational biology. The main idea is to perform...
متن کامل